0.07/0.12 % Problem : SLH537^1 : TPTP v7.5.0. Released v7.5.0. 0.07/0.13 % Command : run_E %s %d THM 0.14/0.34 % Computer : n028.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 30 0.14/0.34 % WCLimit : 30 0.14/0.34 % DateTime : Tue Aug 9 03:18:50 EDT 2022 0.14/0.34 % CPUTime : 0.21/0.47 The problem SPC is TH0_THM_EQU_NAR 0.21/0.47 Running higher-order on 1 cores theorem proving 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.21/0.47 # Version: 3.0pre003-ho 0.21/0.51 # Preprocessing class: HSLMSMSMSSLNHSA. 0.21/0.51 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.21/0.51 # Starting new_bool_8 with 30s (1) cores 0.21/0.51 # new_bool_8 with pid 31772 completed with status 0 0.21/0.51 # Result found by new_bool_8 0.21/0.51 # Preprocessing class: HSLMSMSMSSLNHSA. 0.21/0.51 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.21/0.51 # Starting new_bool_8 with 30s (1) cores 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0) 0.21/0.51 # ...ProofStateSinE()=33/484 0.21/0.51 # Search class: HGUSM-FFMF32-MHSFFMBN 0.21/0.51 # partial match(3): HGUSM-FFMF32-SHSFMSBN 0.21/0.51 # Scheduled 6 strats onto 1 cores with 30 seconds (30 total) 0.21/0.51 # Starting new_ho_10 with 6s (1) cores 0.21/0.51 # new_ho_10 with pid 31773 completed with status 0 0.21/0.51 # Result found by new_ho_10 0.21/0.51 # Preprocessing class: HSLMSMSMSSLNHSA. 0.21/0.51 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.21/0.51 # Starting new_bool_8 with 30s (1) cores 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0) 0.21/0.51 # ...ProofStateSinE()=33/484 0.21/0.51 # Search class: HGUSM-FFMF32-MHSFFMBN 0.21/0.51 # partial match(3): HGUSM-FFMF32-SHSFMSBN 0.21/0.51 # Scheduled 6 strats onto 1 cores with 30 seconds (30 total) 0.21/0.51 # Starting new_ho_10 with 6s (1) cores 0.21/0.51 # Preprocessing time : 0.003 s 0.21/0.51 # Presaturation interreduction done 0.21/0.51 0.21/0.51 # Proof found! 0.21/0.51 # SZS status Theorem 0.21/0.51 # SZS output start CNFRefutation 0.21/0.51 thf(decl_22, type, code_Suc: code_natural > code_natural). 0.21/0.51 thf(decl_23, type, from_nat_nat: nat > nat). 0.21/0.51 thf(decl_24, type, from_nat_rat: nat > rat). 0.21/0.51 thf(decl_25, type, nat_to_rat_surj: nat > rat). 0.21/0.51 thf(decl_26, type, to_nat_nat: nat > nat). 0.21/0.51 thf(decl_27, type, to_nat_rat: rat > nat). 0.21/0.51 thf(decl_28, type, finite_Fpow_nat: set_nat > set_set_nat). 0.21/0.51 thf(decl_29, type, finite_Fpow_rat: set_rat > set_set_rat). 0.21/0.51 thf(decl_30, type, finite_Fpow_b: set_b > set_set_b). 0.21/0.51 thf(decl_31, type, finite_Fpow_c: set_c > set_set_c). 0.21/0.51 thf(decl_32, type, fun_upd_nat_rat: (nat > rat) > nat > rat > nat > rat). 0.21/0.51 thf(decl_33, type, fun_upd_nat_b: (nat > b) > nat > b > nat > b). 0.21/0.51 thf(decl_34, type, fun_upd_nat_c: (nat > c) > nat > c > nat > c). 0.21/0.51 thf(decl_35, type, fun_upd_rat_b: (rat > b) > rat > b > rat > b). 0.21/0.51 thf(decl_36, type, fun_upd_rat_c: (rat > c) > rat > c > rat > c). 0.21/0.51 thf(decl_37, type, inj_on_nat_b: (nat > b) > set_nat > $o). 0.21/0.51 thf(decl_38, type, inj_on_nat_c: (nat > c) > set_nat > $o). 0.21/0.51 thf(decl_39, type, inj_on_rat_nat: (rat > nat) > set_rat > $o). 0.21/0.51 thf(decl_40, type, inj_on_b_nat: (b > nat) > set_b > $o). 0.21/0.51 thf(decl_41, type, inj_on_c_nat: (c > nat) > set_c > $o). 0.21/0.51 thf(decl_42, type, swap_nat_nat: nat > nat > (nat > nat) > nat > nat). 0.21/0.51 thf(decl_43, type, swap_nat_rat: nat > nat > (nat > rat) > nat > rat). 0.21/0.51 thf(decl_44, type, swap_nat_b: nat > nat > (nat > b) > nat > b). 0.21/0.51 thf(decl_45, type, swap_nat_c: nat > nat > (nat > c) > nat > c). 0.21/0.51 thf(decl_46, type, swap_rat_nat: rat > rat > (rat > nat) > rat > nat). 0.21/0.51 thf(decl_47, type, swap_rat_rat: rat > rat > (rat > rat) > rat > rat). 0.21/0.51 thf(decl_48, type, hilber1655259809on_nat: (nat > nat) > $o). 0.21/0.51 thf(decl_49, type, hilber822638761on_rat: (rat > rat) > $o). 0.21/0.51 thf(decl_50, type, hilber815131374at_nat: set_nat > (nat > nat) > nat > nat). 0.21/0.51 thf(decl_51, type, hilber2129993974at_rat: set_nat > (nat > rat) > rat > nat). 0.21/0.51 thf(decl_52, type, hilber1385912161_nat_b: set_nat > (nat > b) > b > nat). 0.21/0.51 thf(decl_53, type, hilber1385912162_nat_c: set_nat > (nat > c) > c > nat). 0.21/0.51 thf(decl_54, type, hilber819527926at_nat: set_rat > (rat > nat) > nat > rat). 0.21/0.51 thf(decl_55, type, hilber2134390526at_rat: set_rat > (rat > rat) > rat > rat). 0.21/0.51 thf(decl_56, type, hilber190996995_b_nat: set_b > (b > nat) > nat > b). 0.21/0.51 thf(decl_57, type, hilbert_inv_into_b_b: set_b > (b > b) > b > b). 0.21/0.51 thf(decl_58, type, hilbert_inv_into_b_c: set_b > (b > c) > c > b). 0.21/0.51 thf(decl_59, type, hilber1520033284_c_nat: set_c > (c > nat) > nat > c). 0.21/0.51 thf(decl_60, type, hilbert_inv_into_c_b: set_c > (c > b) > b > c). 0.21/0.51 thf(decl_61, type, hilbert_inv_into_c_c: set_c > (c > c) > c > c). 0.21/0.51 thf(decl_62, type, listIn37602503op_rat: nat > (nat > rat) > nat > rat). 0.21/0.51 thf(decl_63, type, listIn1417627087drop_a: nat > (nat > a) > nat > a). 0.21/0.51 thf(decl_64, type, listIn1417627088drop_b: nat > (nat > b) > nat > b). 0.21/0.51 thf(decl_65, type, listIn1417627089drop_c: nat > (nat > c) > nat > c). 0.21/0.51 thf(decl_66, type, listIn655825832_a_a_a: (a > a > a) > (nat > a) > (nat > a) > nat > a). 0.21/0.51 thf(decl_67, type, listIn655825833_a_a_b: (a > a > b) > (nat > a) > (nat > a) > nat > b). 0.21/0.51 thf(decl_68, type, listIn1483595239_a_b_a: (a > b > a) > (nat > a) > (nat > b) > nat > a). 0.21/0.51 thf(decl_69, type, listIn163880998_a_c_a: (a > c > a) > (nat > a) > (nat > c) > nat > a). 0.21/0.51 thf(decl_70, type, listIn1523492649_b_a_a: (b > a > a) > (nat > b) > (nat > a) > nat > a). 0.21/0.51 thf(decl_71, type, listIn203778408_b_b_a: (b > b > a) > (nat > b) > (nat > b) > nat > a). 0.21/0.51 thf(decl_72, type, listIn1031547815_b_c_a: (b > c > a) > (nat > b) > (nat > c) > nat > a). 0.21/0.51 thf(decl_73, type, listIn243675818_c_a_a: (c > a > a) > (nat > c) > (nat > a) > nat > a). 0.21/0.51 thf(decl_74, type, listIn1071445225_c_b_a: (c > b > a) > (nat > c) > (nat > b) > nat > a). 0.21/0.51 thf(decl_75, type, listIn1899214632_c_c_a: (c > c > a) > (nat > c) > (nat > c) > nat > a). 0.21/0.51 thf(decl_76, type, ord_less_eq_b_o: (b > $o) > (b > $o) > $o). 0.21/0.51 thf(decl_77, type, ord_less_eq_c_o: (c > $o) > (c > $o) > $o). 0.21/0.51 thf(decl_78, type, ord_less_eq_set_nat: set_nat > set_nat > $o). 0.21/0.51 thf(decl_79, type, ord_less_eq_set_rat: set_rat > set_rat > $o). 0.21/0.51 thf(decl_80, type, ord_le1794175652et_rat: set_set_rat > set_set_rat > $o). 0.21/0.51 thf(decl_81, type, ord_le1458284639_set_b: set_set_b > set_set_b > $o). 0.21/0.51 thf(decl_82, type, ord_le450365280_set_c: set_set_c > set_set_c > $o). 0.21/0.51 thf(decl_83, type, ord_less_eq_set_a: set_a > set_a > $o). 0.21/0.51 thf(decl_84, type, ord_less_eq_set_b: set_b > set_b > $o). 0.21/0.51 thf(decl_85, type, ord_less_eq_set_c: set_c > set_c > $o). 0.21/0.51 thf(decl_86, type, top_top_nat_o: nat > $o). 0.21/0.51 thf(decl_87, type, top_top_rat_o: rat > $o). 0.21/0.51 thf(decl_88, type, top_top_b_o: b > $o). 0.21/0.51 thf(decl_89, type, top_top_c_o: c > $o). 0.21/0.51 thf(decl_90, type, top_top_set_nat: set_nat). 0.21/0.51 thf(decl_91, type, top_top_set_rat: set_rat). 0.21/0.51 thf(decl_92, type, top_top_set_set_nat: set_set_nat). 0.21/0.51 thf(decl_93, type, top_top_set_set_rat: set_set_rat). 0.21/0.51 thf(decl_94, type, top_top_set_b: set_b). 0.21/0.51 thf(decl_95, type, top_top_set_c: set_c). 0.21/0.51 thf(decl_96, type, field_559626550ts_rat: set_rat). 0.21/0.51 thf(decl_97, type, powp_b: (b > $o) > set_b > $o). 0.21/0.51 thf(decl_98, type, powp_c: (c > $o) > set_c > $o). 0.21/0.51 thf(decl_99, type, collect_nat: (nat > $o) > set_nat). 0.21/0.51 thf(decl_100, type, collect_rat: (rat > $o) > set_rat). 0.21/0.51 thf(decl_101, type, collect_b: (b > $o) > set_b). 0.21/0.51 thf(decl_102, type, collect_c: (c > $o) > set_c). 0.21/0.51 thf(decl_103, type, pow_nat: set_nat > set_set_nat). 0.21/0.51 thf(decl_104, type, pow_rat: set_rat > set_set_rat). 0.21/0.51 thf(decl_105, type, pow_b: set_b > set_set_b). 0.21/0.51 thf(decl_106, type, pow_c: set_c > set_set_c). 0.21/0.51 thf(decl_107, type, image_nat_nat: (nat > nat) > set_nat > set_nat). 0.21/0.51 thf(decl_108, type, image_nat_rat: (nat > rat) > set_nat > set_rat). 0.21/0.51 thf(decl_109, type, image_nat_a: (nat > a) > set_nat > set_a). 0.21/0.51 thf(decl_110, type, image_nat_b: (nat > b) > set_nat > set_b). 0.21/0.51 thf(decl_111, type, image_nat_c: (nat > c) > set_nat > set_c). 0.21/0.51 thf(decl_112, type, image_rat_nat: (rat > nat) > set_rat > set_nat). 0.21/0.51 thf(decl_113, type, image_rat_rat: (rat > rat) > set_rat > set_rat). 0.21/0.51 thf(decl_114, type, image_rat_b: (rat > b) > set_rat > set_b). 0.21/0.51 thf(decl_115, type, image_rat_c: (rat > c) > set_rat > set_c). 0.21/0.51 thf(decl_116, type, image_752520987et_rat: (set_nat > set_rat) > set_set_nat > set_set_rat). 0.21/0.51 thf(decl_117, type, image_set_nat_set_b: (set_nat > set_b) > set_set_nat > set_set_b). 0.21/0.51 thf(decl_118, type, image_set_nat_set_c: (set_nat > set_c) > set_set_nat > set_set_c). 0.21/0.51 thf(decl_119, type, image_b_nat: (b > nat) > set_b > set_nat). 0.21/0.51 thf(decl_120, type, image_b_rat: (b > rat) > set_b > set_rat). 0.21/0.51 thf(decl_121, type, image_b_b: (b > b) > set_b > set_b). 0.21/0.51 thf(decl_122, type, image_b_c: (b > c) > set_b > set_c). 0.21/0.51 thf(decl_123, type, image_c_nat: (c > nat) > set_c > set_nat). 0.21/0.51 thf(decl_124, type, image_c_rat: (c > rat) > set_c > set_rat). 0.21/0.51 thf(decl_125, type, image_c_b: (c > b) > set_c > set_b). 0.21/0.51 thf(decl_126, type, image_c_c: (c > c) > set_c > set_c). 0.21/0.51 thf(decl_127, type, member_nat: nat > set_nat > $o). 0.21/0.51 thf(decl_128, type, member_rat: rat > set_rat > $o). 0.21/0.51 thf(decl_129, type, member_set_b: set_b > set_set_b > $o). 0.21/0.51 thf(decl_130, type, member_set_c: set_c > set_set_c > $o). 0.21/0.51 thf(decl_131, type, member_a: a > set_a > $o). 0.21/0.51 thf(decl_132, type, member_b: b > set_b > $o). 0.21/0.51 thf(decl_133, type, member_c: c > set_c > $o). 0.21/0.51 thf(decl_134, type, f: b > c > a). 0.21/0.51 thf(decl_135, type, x: b). 0.21/0.51 thf(decl_136, type, y: c). 0.21/0.51 thf(decl_137, type, esk1_0: nat). 0.21/0.51 thf(decl_138, type, esk2_4: (b > c > a) > (nat > b) > (nat > c) > (b > c > a) > nat). 0.21/0.51 thf(decl_139, type, esk3_6: (nat > b) > (nat > b) > (nat > c) > (nat > c) > (b > c > a) > (b > c > a) > b). 0.21/0.51 thf(decl_140, type, esk4_6: (nat > b) > (nat > b) > (nat > c) > (nat > c) > (b > c > a) > (b > c > a) > c). 0.21/0.51 thf(decl_141, type, esk5_2: (nat > c) > (nat > c) > nat). 0.21/0.51 thf(decl_142, type, esk6_2: (nat > b) > (nat > b) > nat). 0.21/0.51 thf(decl_143, type, esk7_2: (nat > a) > (nat > a) > nat). 0.21/0.51 thf(decl_144, type, esk8_2: c > (nat > c) > nat). 0.21/0.51 thf(decl_145, type, esk9_2: (nat > c) > (c > $o) > c). 0.21/0.51 thf(decl_146, type, esk10_2: (c > $o) > (nat > c) > nat). 0.21/0.51 thf(decl_147, type, esk11_2: (nat > c) > (c > $o) > c). 0.21/0.51 thf(decl_148, type, esk12_2: (nat > c) > (c > $o) > nat). 0.21/0.51 thf(decl_149, type, esk13_2: c > (nat > c) > nat). 0.21/0.51 thf(decl_150, type, esk14_2: b > (nat > b) > nat). 0.21/0.51 thf(decl_151, type, esk15_2: (nat > b) > (b > $o) > b). 0.21/0.51 thf(decl_152, type, esk16_2: (b > $o) > (nat > b) > nat). 0.21/0.51 thf(decl_153, type, esk17_2: (nat > b) > (b > $o) > b). 0.21/0.51 thf(decl_154, type, esk18_2: (nat > b) > (b > $o) > nat). 0.21/0.51 thf(decl_155, type, esk19_2: b > (nat > b) > nat). 0.21/0.51 thf(decl_156, type, esk20_0: nat > b). 0.21/0.51 thf(decl_157, type, esk21_0: nat > c). 0.21/0.51 thf(decl_158, type, esk22_1: c > nat > c). 0.21/0.51 thf(decl_159, type, esk23_1: b > nat > b). 0.21/0.51 thf(decl_160, type, esk24_1: a > nat > a). 0.21/0.51 thf(decl_161, type, esk25_2: (nat > b) > (nat > b) > nat). 0.21/0.51 thf(decl_162, type, esk26_2: (nat > c) > (nat > c) > nat). 0.21/0.51 thf(decl_163, type, esk27_2: (nat > a) > (nat > a) > nat). 0.21/0.51 thf(decl_164, type, esk28_2: (nat > b) > (nat > b) > nat). 0.21/0.51 thf(decl_165, type, esk29_2: (nat > c) > (nat > c) > nat). 0.21/0.51 thf(fact_0_i__map2__def, axiom, ((listIn1031547815_b_c_a)=(^[X1:b > c > a, X2:nat > b, X3:nat > c, X4:nat]:(X1 @ (X2 @ X4) @ (X3 @ X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_i__map2__def)). 0.21/0.51 thf(conj_0, conjecture, ((listIn1031547815_b_c_a @ f @ (^[X4:nat]:(x)) @ (^[X4:nat]:(y)))=(^[X4:nat]:(f @ x @ y))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.21/0.51 thf(c_0_2, plain, ![X923:b > c > a, X924:nat > b, X925:nat > c, X926:nat]:(((listIn1031547815_b_c_a @ X923 @ X924 @ X925 @ X926)=(X923 @ (X924 @ X926) @ (X925 @ X926)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_0_i__map2__def])])). 0.21/0.51 thf(c_0_3, negated_conjecture, ~(![X922:nat]:(((listIn1031547815_b_c_a @ f @ (^[Z0:nat]:(x)) @ (^[Z0:nat]:(y)) @ X922)=(f @ x @ y)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])])). 0.21/0.51 thf(c_0_4, plain, ![X941:b > c > a, X942:nat > b, X943:nat > c, X944:nat]:(((listIn1031547815_b_c_a @ X941 @ X942 @ X943 @ X944)=(X941 @ (X942 @ X944) @ (X943 @ X944)))), inference(variable_rename,[status(thm)],[c_0_2])). 0.21/0.51 thf(c_0_5, plain, ![X1088:nat]:(((esk21_0 @ X1088)=(y))), inference(variable_rename,[status(thm)],[])). 0.21/0.51 thf(c_0_6, negated_conjecture, ((listIn1031547815_b_c_a @ f @ (^[Z0:nat]:(x)) @ (^[Z0:nat]:(y)) @ esk1_0)!=(f @ x @ y)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])). 0.21/0.51 thf(c_0_7, plain, ![X1078:nat]:(((esk21_0 @ X1078)=(y))), introduced(definition)). 0.21/0.51 thf(c_0_8, plain, ![X1077:nat]:(((esk20_0 @ X1077)=(x))), introduced(definition)). 0.21/0.51 thf(c_0_9, plain, ![X1:b > c > a, X2:nat > b, X3:nat > c, X4:nat]:(((listIn1031547815_b_c_a @ X1 @ X2 @ X3 @ X4)=(X1 @ (X2 @ X4) @ (X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.21/0.51 thf(c_0_10, plain, ![X4:nat]:(((esk21_0 @ X4)=(y))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.21/0.51 thf(c_0_11, plain, ![X1089:nat]:(((esk20_0 @ X1089)=(x))), inference(variable_rename,[status(thm)],[])). 0.21/0.51 thf(c_0_12, negated_conjecture, ((listIn1031547815_b_c_a @ f @ esk20_0 @ esk21_0 @ esk1_0)!=(f @ x @ y)), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6]), c_0_7]), c_0_8])). 0.21/0.51 thf(c_0_13, plain, ![X1:b > c > a, X2:nat > b, X4:nat]:(((listIn1031547815_b_c_a @ X1 @ X2 @ esk21_0 @ X4)=(X1 @ (X2 @ X4) @ y))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.21/0.51 thf(c_0_14, plain, ![X4:nat]:(((esk20_0 @ X4)=(x))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.21/0.51 thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), ['proof']). 0.21/0.51 # SZS output end CNFRefutation 0.21/0.51 # Parsed axioms : 484 0.21/0.51 # Removed by relevancy pruning/SinE : 451 0.21/0.51 # Initial clauses : 52 0.21/0.51 # Removed in clause preprocessing : 3 0.21/0.51 # Initial clauses in saturation : 49 0.21/0.51 # Processed clauses : 94 0.21/0.51 # ...of these trivial : 1 0.21/0.51 # ...subsumed : 3 0.21/0.51 # ...remaining for further processing : 90 0.21/0.51 # Other redundant clauses eliminated : 10 0.21/0.51 # Clauses deleted for lack of memory : 0 0.21/0.51 # Backward-subsumed : 0 0.21/0.51 # Backward-rewritten : 1 0.21/0.51 # Generated clauses : 69 0.21/0.51 # ...of the previous two non-redundant : 44 0.21/0.51 # ...aggressively subsumed : 0 0.21/0.51 # Contextual simplify-reflections : 0 0.21/0.51 # Paramodulations : 46 0.21/0.51 # Factorizations : 0 0.21/0.51 # NegExts : 5 0.21/0.51 # Equation resolutions : 15 0.21/0.51 # Propositional unsat checks : 0 0.21/0.51 # Propositional check models : 0 0.21/0.51 # Propositional check unsatisfiable : 0 0.21/0.51 # Propositional clauses : 0 0.21/0.51 # Propositional clauses after purity: 0 0.21/0.51 # Propositional unsat core size : 0 0.21/0.51 # Propositional preprocessing time : 0.000 0.21/0.51 # Propositional encoding time : 0.000 0.21/0.51 # Propositional solver time : 0.000 0.21/0.51 # Success case prop preproc time : 0.000 0.21/0.51 # Success case prop encoding time : 0.000 0.21/0.51 # Success case prop solver time : 0.000 0.21/0.51 # Current number of processed clauses : 38 0.21/0.51 # Positive orientable unit clauses : 19 0.21/0.51 # Positive unorientable unit clauses: 1 0.21/0.51 # Negative unit clauses : 0 0.21/0.51 # Non-unit-clauses : 18 0.21/0.51 # Current number of unprocessed clauses: 43 0.21/0.51 # ...number of literals in the above : 76 0.21/0.51 # Current number of archived formulas : 0 0.21/0.51 # Current number of archived clauses : 45 0.21/0.51 # Clause-clause subsumption calls (NU) : 227 0.21/0.51 # Rec. Clause-clause subsumption calls : 197 0.21/0.51 # Non-unit clause-clause subsumptions : 2 0.21/0.51 # Unit Clause-clause subsumption calls : 4 0.21/0.51 # Rewrite failures with RHS unbound : 0 0.21/0.51 # BW rewrite match attempts : 204 0.21/0.51 # BW rewrite match successes : 3 0.21/0.51 # Condensation attempts : 94 0.21/0.51 # Condensation successes : 0 0.21/0.51 # Termbank termtop insertions : 9959 0.21/0.51 0.21/0.51 # ------------------------------------------------- 0.21/0.51 # User time : 0.013 s 0.21/0.51 # System time : 0.007 s 0.21/0.51 # Total time : 0.020 s 0.21/0.51 # Maximum resident set size: 3556 pages 0.21/0.51 0.21/0.51 # ------------------------------------------------- 0.21/0.51 # User time : 0.028 s 0.21/0.51 # System time : 0.009 s 0.21/0.51 # Total time : 0.037 s 0.21/0.51 # Maximum resident set size: 2708 pages 0.21/0.51 EOF